Lattices whose congruences form a boolean algebra

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permutative Semigroups Whose Congruences Form a Chain ∗

Semigroups whose congruences form a chain are often termed ∆-semigroups. The commutative ∆-semigroups were determined by Schein and by Tamura. A natural generalization of commutativity is permutativity: a semigroup is permutative if it satisfies a non-identity permutational identity. We completely determine the permutative ∆-semigroups. It turns out that there are only six noncommutative exampl...

متن کامل

On lattices whose minimal vectors form a 6-design

Spherical designs have been introduced in 1977 by Delsarte, Goethals and Seidel [11] and soon afterwards studied by Eiichi Bannai in a series of papers (see [3], [4], [5] to mention only a few of them). A spherical t-design is a finite subset X of the sphere such that every polynomial on R of total degree at most t has the same average over X as over the entire sphere. The theory of lattices ha...

متن کامل

Boolean factor Congruences and Property (*)

A variety V has Boolean factor congruences (BFC) if the set of factor congruences of every algebra in V is a distributive sublattice of its congruence lattice; this property holds in rings with unit and in every variety which has a semilattice operation. BFC has a prominent role in the study of uniqueness of direct product representations of algebras, since it is a strengthening of the refineme...

متن کامل

Finite lattices and congruences. A survey

In the early forties, R. P. Dilworth proved his famous result: Every finite distributive lattice D can be represented as the congruence lattice of a finite lattice L. In one of our early papers, we presented the first published proof of this result; in fact we proved: Every finite distributive lattice D can be represented as the congruence lattice of a finite sectionally complemented lattice L....

متن کامل

Finite Lattices with Isoform Congruences

We call a lattice L isoform, if for any congruence relation Θ of L, all congruence classes of Θ are isomorphic sublattices. We prove that for every finite distributive lattice D, there exists a finite isoform lattice L such that the congruence lattice of L is isomorphic to D.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1960

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1960.10.787